Quasi-regular Tessellation of Hexagons
نویسندگان
چکیده
A tessellation is a process that surrounds us every day. It is an old problem in mathematics and in computational geometry Preparata, 1985 . Several tessellations are known, although only some of them are interesting in the computational geometry. The main aim of the tessellation is to tile or divide the space of the interest into smaller parts tiles upon which other problems could be solved more easily e.g. geometric search, visualising only parts of the interest .
منابع مشابه
From symmetry break to Poisson point process in 2D Voronoi tessellations: the generic nature of hexagons
We bridge the properties of the regular square and honeycomb Voronoi tessellations of the plane to those of the Poisson-Voronoi case, thus analyzing in a common framework symmetry-break processes and the approach to uniformly random distributions of tessellation-generating points. We resort to ensemble simulations of tessellations generated by points whose regular positions is perturbed through...
متن کاملk-resonance of open-ended carbon nanotubes
An open-ended carbon nanotube or a tubule is a part of some regular hexagonal tessellation of a cylinder. A tubule T is said to be k-resonant if for every k (or fewer) pairwise disjoint hexagons, the subgraph obtained from T by deleting all the vertices of these hexagons must have a Kekule structure (perfect matching) or must be empty. The 1-resonant tubules can be constructed by an approach pr...
متن کاملSymmetry-Break in Voronoi Tessellations
We analyse in a common framework the properties of the Voronoi tessellations resulting from regular 2D and 3D crystals and those of tessellations generated by Poisson distributions of points, thus joining on symmetry breaking processes and the approach to uniform random distributions of seeds. We perturb crystalline structures in 2D and 3D with a spatial Gaussian noise whose adimensional streng...
متن کاملPiece by Piece: a Method of Cartographic Line Generalization Using Regular Hexagonal Tessellation
Several methods of automated line simplification exist, but most involve parameters selected arbitrarily or heuristically, with little or no reference to the scale change between original data and generalized output. Also, while routines such as the Douglas-Peucker algorithm achieve simplified line correlates by retention of characteristic points from the input line, little analysis has been de...
متن کاملMetric Problems in Triple Loop Graphs and Digraphs Associated to an Hexagonal Tessellation of the Plane
The use of plane tessellations by hexagons facilitates the study of a family of triple loop digraphs and a family of triple loop graphs and enables us to give the minimum diameter, mean distance and vulnerability results for every order.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004